417C - Football - CodeForces Solution


constructive algorithms graphs implementation *1400

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
if(2*k>=n){
cout<<-1;
return 0;
}
cout<<n*k<<"\n";
for(int i=1;i<=n;i++){
for(int j=i+1;j<=i+k;j++)
cout<<i<<" "<<(j-1)%n+1<<"\n";
}
}


Comments

Submit
0 Comments
More Questions

1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square
1389A - LCM Problem
778A - String Game
1382A - Common Subsequence
1512D - Corrupted Array
667B - Coat of Anticubism
284B - Cows and Poker Game
1666D - Deletive Editing
1433D - Districts Connection
2B - The least round way
1324A - Yet Another Tetris Problem
246B - Increase and Decrease
22E - Scheme
1566A - Median Maximization
1278A - Shuffle Hashing
1666F - Fancy Stack
1354A - Alarm Clock
1543B - Customising the Track
1337A - Ichihime and Triangle
1366A - Shovels and Swords
919A - Supermarket
630C - Lucky Numbers
1208B - Uniqueness
1384A - Common Prefixes
371A - K-Periodic Array
1542A - Odd Set